On the Complexity of Sandpile Prediction Problems
نویسندگان
چکیده
In this work we study the complexity of Sandpile prediction problems on several classes of directed graphs. We focus our research on low-dimensional directed lattices. We prove some upper and lower bounds for those problems. Our approach is based on the analysis of some reachability problems related to sandpiles.
منابع مشابه
The Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical con gurations. We prove that the algorithmic problem consisting in predicting the evolution of three dimensional critical avalanches is P -complete and 6 p n-strict hard for P . On the other hand we prove that three-dimensional avalanches are superlinear long on average. I...
متن کاملComputational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with configurations in KSPM. The proof is also related to the known prediction problem for sandpile which is in NC for one-dimensional sandpiles and is P-compl...
متن کاملComputational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with configurations in KSPM. The proof is also related to the known prediction problem for sandpile which is in NC for one-dimensional sandpiles and is P-c...
متن کاملTwo Notes on the Computational Complexity of One-Dimensional Sandpiles
We prove that the one-dimensional sandpile prediction problem is in AC. The previously best known upper bound on the AC-scale was AC. We also prove that it is not in AC1− for any constant
متن کاملOn Tinhofer's Linear Programming Approach to Isomorphism Testing
On the complexity of master problems Emergence on decreasing sandpile models 14:35 Kosolobov Durand, Romashchenko Faster lightweight Lempel-Ziv parsing Quasiperiodicity and non-computability in tilings On the Complexity of Noncommutative Polynomial Factorization
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 252 شماره
صفحات -
تاریخ انتشار 2009